Filling the gap between Turán's theorem and Pósa's conjecture

نویسندگان

  • Peter Allen
  • Julia Böttcher
  • Jan Hladký
چکیده

Much of extremal graph theory has concentrated either on finding very small subgraphs of a large graph (such as Turán’s theorem) or on finding spanning subgraphs (such as Dirac’s theorem or more recently the Pósa conjecture). Only a few results give conditions to obtain some intermediate-sized subgraph. We contend that this neglect is unjustified. In this paper we investigate minimum-degree conditions under which a graph G contains squared paths and squared cycles of arbitrary specified lengths. We determine precise thresholds, assuming that the order of G is large. This extends results of Fan and Kierstead [J. Combin. Theory Ser. B 63 (1995), 55–64] and of Komlós, Sarközy, and Szemerédi [Random Structures Algorithms 9 (1996), 193–211] concerning containment of a spanning squared paths and a spanning squared cycle, respectively.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Maximal Length of a Gap between r-Graph Turán Densities

The Turán density π(F) of a family F of r-graphs is the limit as n → ∞ of the maximum edge density of an F-free r-graph on n vertices. Erdős [Israel J. Math 2 (1964):183–190] proved that no Turán density can lie in the open interval (0, r!/rr). Here we show that any other open subinterval of [0, 1] avoiding Turán densities has strictly smaller length. In particular, this implies a conjecture of...

متن کامل

Turán’s theorem with colors

We consider a generalization of Turán’s theorem for edge-colored graphs. Suppose that R (red) and B (blue) are graphs on the same vertex set of size n. We conjecture that if R and B each have more than (1− 1/k)n/2 edges, and K is a (k+ 1)-clique whose edges are arbitrarily colored with red and blue, then R ∪B contains a colored copy of K, for all k + 1 6∈ {4, 6, 8}. If k + 1 ∈ {4, 6, 8}, then t...

متن کامل

Convex hull of face vectors of colored complexes

In this paper we verify a conjecture by Kozlov (Discrete Comput Geom 18 (1997) 421–431), which describes the convex hull of the set of face vectors of r-colorable complexes on n vertices. As part of the proof we derive a generalization of Turán’s graph theorem.

متن کامل

On some generalisations of Brown's conjecture

Let $P$ be a complex polynomial of the form $P(z)=zdisplaystyleprod_{k=1}^{n-1}(z-z_{k})$,where $|z_k|ge 1,1le kle n-1$ then $ P^prime(z)ne 0$. If $|z|

متن کامل

Packing Cliques in Graphs with Independence Number 2

Let G be a graph with no three independent vertices. How many edges of G can be packed with edge-disjoint copies of Kk? More specifically, let fk(n,m) be the largest integer t such that for any graph with n vertices, m edges, and independence number 2, at least t edges can be packed with edge-disjoint copies ofKk. Turán’s Theorem together with Wilson’s Theorem assert that fk(n,m) = (1−o(1)) 2 4...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. London Math. Society

دوره 84  شماره 

صفحات  -

تاریخ انتشار 2011